A Fano-Huffman Based Statistical Coding Method
نویسندگان
چکیده
Statistical coding techniques have been used for lossless statistical data compression, applying methods such as Ordinary, Shannon, Fano, Enhanced Fano, Huffman and Shannon-Fano-Elias coding methods. A new and improved coding method is presented, the Fano-Huffman Based Statistical Coding Method. It holds the advantages of both the Fano and Huffman coding methods. It is more easily applicable than the Huffman coding methods and it is more optimal than Fano coding method. The optimality with respect to the other methods is realized on the basis of
منابع مشابه
Text Compression Algorithms - a Comparative Study
Data Compression may be defined as the science and art of the representation of information in a crisply condensed form. For decades, Data compression has been one of the critical enabling technologies for the ongoing digital multimedia revolution. There are a lot of data compression algorithms which are available to compress files of different formats. This paper provides a survey of different...
متن کاملData compression by Shannonfannon Algorithm
Statistical coding techniques have been used for a long time in lossless data compression, using methods such as Huffmans algorithm, arithmetic coding, Shannon’s method, Fano’s method, etc. Most of these methods can be implemented either statically or adaptively. In this paper, we show that although Fano coding is sub-optimal, it is possible to generate static Fano-based encoding schemes which ...
متن کاملUsing an innovative coding algorithm for data encryption∗
This paper discusses the problem of using data compression for encryption. We first propose an algorithm for breaking a prefix-coded file by enumeration. Based on the algorithm, we respectively analyze the complexity of breaking Huffman codes and Shannon-Fano-Elias codes under the assumption that the cryptanalyst knows the code construction rule and the probability mass function of the source. ...
متن کاملEfficient Adaptive Data Compression Using Fano Binary Search Trees
In this paper, we show an effective way of using adaptive self-organizing data structures in enhancing compression schemes. We introduce a new data structure, the Partitioning Binary Search Tree (PBST), which is based on the well-known Binary Search Tree (BST), and when used in conjunction with Fano encoding, the PBST leads to the so-called Fano Binary Search Tree (FBST). The PBST and FBST can ...
متن کاملA fast and efficient nearly-optimal adaptive Fano coding scheme
Adaptive coding techniques have been increasingly used in lossless data compression. They are suitable for a wide range of applications, in which on-line compression is required, including communications, internet, e-mail, and e-commerce. In this paper, we present an adaptive Fano coding method applicable to binary and multi-symbol code alphabets. We introduce the corresponding partitioning pro...
متن کامل